Quantum Probability Aspects to Lexicographic and Strong Products of Graphs
نویسندگان
چکیده
منابع مشابه
On Lexicographic Products of Two Fuzzy Graphs
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products a...
متن کامل1-Planar Lexicographic Products of Graphs
A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar lexicographic products. Mathematics Subject Classification: 05C10, 05C62, 05C76
متن کاملConvex Sets in Lexicographic Products of Graphs
Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies [4, Theorem 3.1].
متن کاملThe copnumber for lexicographic products and sums of graphs
For the lexicographic product G • H of two graphs G and H so that G is connected, we prove that if the copnumber c(G) of G is greater than or equal to 2, then c(G • H) = c(G). Moreover, if c(G) = c(H) = 1, then c(G • H) = 1. If c(G) = 1, G has more than one vertex, and c(H) ≥ 2, then c(G • H) = 2. We also provide the copnumber for general lexicographic sums. The game of cops and robbers on a gr...
متن کاملEnd-Completely-Regular and End-Inverse Lexicographic Products of Graphs
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X) is completely regular (resp., inverse). In this paper, we will show that if X[Y] is End-completely-regular (resp., End-inverse), then both X and Y are End-completely-regular (resp., End-inverse). We give several approaches to construct new End-completely-regular graphs by means of the lexicogra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2016
ISSN: 1340-9050,1347-6157
DOI: 10.4036/iis.2016.s.01